A combinatorial necessary and sufficient condition for cluster consensus
نویسندگان
چکیده
منابع مشابه
A combinatorial necessary and sufficient condition for cluster consensus
In this technical note, cluster consensus of discretetime linear multi-agent systems is investigated. A set of stochastic matrices P is said to be a cluster consensus set if the system achieves cluster consensus for any initial state and any sequence of matrices taken from P . By introducing a cluster ergodicity coefficient, we present an equivalence relation between a range of characterization...
متن کاملHow to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
A set of stochastic matrices P is a consensus set if for every sequence of matrices P (1), P (2), . . . whose elements belong to P and every initial state x(0), the sequence of states defined by x(t) = P (t)P (t − 1) · · ·P (1)x(0) converges to a vector whose entries are all identical. In this paper, we introduce an “avoiding set condition” for compact sets of matrices and prove in our main the...
متن کاملA Necessary and Sufficient Condition for Transcendency
As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...
متن کاملA Necessary and Sufficient Condition for Peace∗
This paper examines the possibility for two contestants to agree on a peace settlement thereby avoiding a contest, in which each would exert a costly effort given the posterior distributions inferred from the negotiation. I find a necessary and sufficient condition of the prior distributions for there to exist a negotiation mechanism that admits a peace-ensuring perfect Bayesian equilibrium. Th...
متن کاملA necessary and sufficient minimality condition for uncertain systems
A necessary and sufficient condition is given for the exact reduction of systems modeled by linear fractional transformations (LFT’s) on structured operator sets. This condition is based on the existence of a rank-deficient solution to either of a pair of linear matrix inequalities which generalize Lyapunov equations; the notion of Gramians is thus also generalized to uncertain systems, as well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2016
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2016.08.025